Logarithmic advice classesBALCAZAR, J. L; SCHÖNING, U.Theoretical computer science. 1992, Vol 99, Num 2, pp 279-290, issn 0304-3975Article

Baire's categories on small complexity classesMOSER, Philippe.Lecture notes in computer science. 2003, pp 333-342, issn 0302-9743, isbn 3-540-40543-7, 10 p.Conference Paper

Complexity classes between θ^p_k and Δ^p_kCASTRO, J; SEARA, C.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 101-121, issn 0988-3754Conference Paper

A tight relationship between generic oracles and type-2 complexity theoryCOOK, S; IMPAGLIAZZO, R; YAMAKAMI, T et al.Information and computation (Print). 1997, Vol 137, Num 2, pp 159-170, issn 0890-5401Article

Problems complete for ○+LDAMM, C.Information processing letters. 1990, Vol 36, Num 5, pp 247-250, issn 0020-0190, 4 p.Article

Complexity-theoretic hierarchiesKRISTIANSEN, Lars.Lecture notes in computer science. 2006, pp 279-288, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 10 p.Conference Paper

Weak completeness in E and E₂JUEDES, D. W; LUTZ, J. H.Theoretical computer science. 1995, Vol 143, Num 1, pp 149-158, issn 0304-3975Article

On sparse hard sets for counting classesOGIWARA, M; LOZANO, A.Theoretical computer science. 1993, Vol 112, Num 2, pp 255-275, issn 0304-3975Article

On sets truth-table reducible to sparse setsBOOK, R. V; KER-I KO.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 903-919, issn 0097-5397Article

On sparse oracles separating feasible complexity classesHARTMANIS, J; HEMACHANDRA, L.Information processing letters. 1988, Vol 28, Num 6, pp 291-295, issn 0020-0190Article

On characterizations of the class PSPACE/polyBALCAZAR, J. L; DIAZ, J; GABARRO, J et al.Theoretical computer science. 1987, Vol 52, Num 3, pp 251-267, issn 0304-3975Article

On relativizations with restricted number of accesses to the oracle setZIMAND, M.Mathematical systems theory. 1987, Vol 20, Num 1, pp 1-11, issn 0025-5661Article

A positive relativization of polynomial time versus polylog spaceGAVALDA, R.Information processing letters. 1993, Vol 46, Num 3, pp 119-123, issn 0020-0190Article

Structural analysis of the complexity of inverse functionsWATANABE, O; TODA, S.Mathematical systems theory. 1993, Vol 26, Num 2, pp 203-214, issn 0025-5661Article

Machine characterizations of the classes of the W-hierarchyCHEN, Yijia; FLUM, Jörg.Lecture notes in computer science. 2003, pp 114-127, issn 0302-9743, isbn 3-540-40801-0, 14 p.Conference Paper

Minimal degrees for polynomial reducibilitiesHOMER, S.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 2, pp 480-491, issn 0004-5411Article

Complexity in predicative arithmeticOSTRIN, Geoffrey E; WAINER, Stan S.Lecture notes in computer science. 2005, pp 378-384, issn 0302-9743, isbn 3-540-26179-6, 7 p.Conference Paper

A first-order isomorphism theoremALLENDER, E; BALCAZAR, J; IMMERMAN, N et al.SIAM journal on computing (Print). 1997, Vol 26, Num 2, pp 557-567, issn 0097-5397Article

A note on balanced immunityMÜLLER, H.Mathematical systems theory. 1993, Vol 26, Num 2, pp 157-167, issn 0025-5661Article

On 1-truth-table-hard languagesHOMER, S; KURTZ, S; ROYER, J et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 383-389, issn 0304-3975Article

Grammatical characterizations of P and PSPACEZHI-ZHONG CHEN; TODA, S.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1990, Vol 73, Num 9, pp 1540-1548, issn 0387-236XArticle

Computational complexity and knowledge complexityGOLDREICH, O; OSTROVSKY, R; PETRANK, E et al.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 1116-1141, issn 0097-5397Article

A uniform circuit lower bound for the permanentALLENDER, E; GORE, V.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 1026-1049, issn 0097-5397Article

Restricted information from nonadaptive queries to NPHAN, Y; THIERAUF, T.Information and computation (Print). 1996, Vol 128, Num 2, pp 119-125, issn 0890-5401Article

A note on the polynomial-time hierarchy and probabilistic operatorsROTHE, J; VOGEL, J.Computers and artificial intelligence. 1994, Vol 13, Num 1, pp 2-12, issn 0232-0274Article